Using LLL-Reduction for Solving RSA and Factorization Problems: A Survey
نویسنده
چکیده
25 years ago, Lenstra, Lenstra and Lovasz presented their celebrated LLL lattice reduction algorithm. Among the various applications of the LLL algorithm is a method due to Coppersmith for finding small roots of polynomial equations. We give a survey of the applications of this root finding method to the problem of inverting the RSA function and the factorization problem. As we will see, most of the results are of a dual nature: They can either be interpreted as cryptanalytic results or as hardness/security results.
منابع مشابه
Using LLL-Reduction for Solving RSA and Factorization Problems
25 years ago, Lenstra, Lenstra and Lovász presented their celebrated LLL lattice reduction algorithm. Among the various applications of the LLL algorithm is a method due to Coppersmith for finding small roots of polynomial equations. We give a survey of the applications of this root finding method to the problem of inverting the RSA function and the factorization problem. As we will see, most o...
متن کاملThe Mathematical Cryptography of the RSA Cryptosystem
Invented in 1977 by Rivest, Shamir and Adleman, the RSA cryptosystem has played a very important role in the development of modern cryptography. Its various applications in industry, Internet, banking, online shopping, cell phones, smart cards, secure information transfers and electronic signatures have made RSA a standard at the heart of modern technologies. This chapter explores the mathemati...
متن کاملDeterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA, where N = pq while ed = 1 mod (p−1)(q−1). In this paper, we show that a deterministic polynomial time equivalence also holds in this variant. The coefficient matrix T to which LL...
متن کاملA Simple Improvement for Integer Factorizations with Implicit Hints
In this paper, we describe an improvement of integer factorization of k RSA moduli Ni = piqi (1 ≤ i ≤ k) with implicit hints, namely all pi share their t least significant bits. May et al. reduced this problem to finding a shortest (or a relatively short) vector in the lattice of dimension k obtained from a given system of k RSAmoduli, for which they applied Gaussian reduction or the LLL algori...
متن کاملA Survey of Direct Methods for Solving Variational Problems
This study presents a comparative survey of direct methods for solving Variational Problems. Thisproblems can be used to solve various differential equations in physics and chemistry like RateEquation for a chemical reaction. There are procedures that any type of a differential equation isconvertible to a variational problem. Therefore finding the solution of a differential equation isequivalen...
متن کامل